Adaptive Probabilistic Flooding for Multipath Routing

In this work, we develop a distributed source routing algorithm for topology discovery suitable for ISP transport networks, that is however inspired by opportunistic algorithms used in ad hoc wireless networks. We propose a plug-and-play control plane, able to find multiple paths toward the same destination, and introduce a novel algorithm, called adaptive probabilistic flooding, to achieve this goal. By keeping a small amount of state in routers taking part in the discovery process, our technique significantly limits the amount of control messages exchanged with flooding -- and, at the same time, it only minimally affects the quality of the discovered multiple path with respect to the optimal solution. Simple analytical bounds, confirmed by results gathered with extensive simulation on four realistic topologies, show our approach to be of high practical interest.Comment: 6 pages, 6 figure

FIB Aplasia through Probabilistic Routing and Autoforwarding

In this work, we propose Aplasia, an holistic architecture with a radical design. Aiming at simplifying the inner network devices (and so their cost), we tradeoff node architecture- and algorithmic-complexity for an increased (but tunable) communication cost. The main ingredients of our recipe are (i) the use of complete paths directly in the frames header, that allows core devices to perform data-plane switching functions without lookup and (ii) the use of a greedy probabilistic routing algorithm to quickly discover multiple, near optimal, paths in the control plane. We extensively simulate, analyze and implement our proposal to testify its soundness

LOCARN: Low Opex Capex Architecture for Resilient Networks

Best Paper AwardInternational audienc

LOCARN: Low Opex Capex Architecture for Resilient Networks

Best Paper AwardInternational audienc

Towards a Large Scale LOCARN Design

International audienc